On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
نویسندگان
چکیده
منابع مشابه
Primal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملOn a General Class of Interior-point Algorithms for Semideenite Programming with Polynomial Complexity and Superlinear Convergence
We propose a uniied analysis for a class of infeasible-start predictor-corrector algorithms for semideenite programming problems, using the Monteiro-Zhang uniied direction. The algorithms are direct generalizations of the Mizuno-Todd-Ye predictor-corrector algorithm for linear programming. We show that the algorithms belonging to this class are globally convergent, provided the problem has a so...
متن کاملSuperlinear and Quadratic Convergence of Aane-scaling Interior-point Newton Methods for Problems with Simple Bounds without Strict Complementarity Assumption Superlinear and Quadratic Convergence of Aane-scaling Interior-point Newton Methods for Problems with Simple Bounds without Strict Complementarity Assumption
A class of aane-scaling interior-point methods for bound constrained optimization problems is introduced which are locally q{superlinear or q{quadratic convergent. It is assumed that the strong second order suucient optimality conditions at the solution are satissed, but strict complementarity is not required. The methods are modiications of the aane-scaling interior-point Newton methods introd...
متن کاملSuperlinear and Quadratic Convergence of Aane-scaling Interior-point Newton Methods for Problems with Simple Bounds without Strct Complementarity Assumption Superlinear and Quadratic Convergence of Aane-scaling Interior-point Newton Methods for Problems with Simple Bounds without Strict Complementarity Assumption
A class of aane-scaling interior-point methods for bound constrained optimization problems is introduced which are locally q{superlinear or q{quadratic convergent. It is assumed that the strong second order suucient optimality conditions at the solution are satissed, but strict complementarity is not required. The methods are modiications of the aane-scaling interior-point Newton methods introd...
متن کاملLocal convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
An example of SDPs (semide nite programs) exhibits a substantial di culty in proving the superlinear convergence of a direct extension of the Mizuno-Todd-Ye type predictorcorrector primal-dual interior-point method for LPs (linear programs) to SDPs, and suggests that we need to force the generated sequence to converge to a solution tangentially to the central path (or trajectory). A Mizuno-Todd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 3 شماره
صفحات -
تاریخ انتشار 1993